On the automorphism group of Cayley graphs generated by transpositions
نویسنده
چکیده
The modified bubble-sort graph of dimension n is the Cayley graph of Sn generated by n cyclically adjacent transpositions. In the present paper, it is shown that the automorphism group of the modified bubble sort graph of dimension n is Sn × D2n, for all n ≥ 5. Thus, a complete structural description of the automorphism group of the modified bubble-sort graph is obtained. A similar direct product decomposition is seen to hold for arbitrary normal Cayley graphs generated by transposition sets.
منابع مشابه
Cayley graphs and symmetric interconnection networks
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. We prove that the vertex-connectivity of edge-transitive graphs is maximum possible. We investigate ...
متن کاملAutomorphism group of the modified bubble-sort graph
The modified bubble-sort graph of dimension n is the Cayley graph of Sn generated by n cyclically adjacent transpositions. In the present paper, it is shown that the automorphism group of the modified bubble sort graph of dimension n is Sn×D2n, for all n ≥ 5. Thus, a complete structural description of the automorphism group of the modified bubble-sort graph is obtained. A similar direct product...
متن کاملRotational Cayley Graphs on Transposition Generated Groups
As it is introduced by Bermond, Kodate, and Prennes, some Cayley graphs, including most popular models for interconnection networks, admit a special auto-morphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the underlying graph. For example, optimal gossiping algorithms can be easily designed, and the constructions of the best known edge d...
متن کاملAutomorphism groups of Cayley graphs generated by connected transposition sets
Let S be a set of transpositions that generates the symmetric group Sn, where n ≥ 3. The transposition graph T (S) is defined to be the graph with vertex set {1, . . . , n} and with vertices i and j being adjacent in T (S) whenever (i, j) ∈ S. We prove that if the girth of the transposition graph T (S) is at least 5, then the automorphism group of the Cayley graph Cay(Sn, S) is the semidirect p...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 64 شماره
صفحات -
تاریخ انتشار 2016